Parallel Hermite Interpolation on Extended Fibonacci Cubes
نویسندگان
چکیده
منابع مشابه
Parallel Hermite Interpolation on Extended Fibonacci Cubes
This work suggests a parallel algorithm for Hermite interpolation on Extended Fibonacci Cube (n) EFC1 . The proposed algorithm has 3 phases: initialization, main and final. The main phase of the algorithm involves 3 2 N multiplications, N additions, N 2 subtractions and N divisions. In final phase we propose an efficient algorithm to accumulate the partial sums of Hermite interpolation in 2 )...
متن کاملParallel Lagrange Interpolation on Extended Fibonacci Cubes
In this paper is presented a parallel algorithm for computing a Lagrange interpolation on a Extended Fibonacci Cube EFC 1(n).The algorithm consists of three phases: initialisation phase, main phase in wich the Lagrange polynomials are computed and final phase in wich the terms of the interpolation formula are added together.
متن کاملParallel Hermite Interpolation on Faulty K-ary n-cubes Network
In this paper a parallel algorithm is developed for Hermite Interpolation k-ary n-cube network. The algorithm involves three phases: initial phase; main phase and final phase. The computational statistics for the parallel algorithm are also discussed. For N = k points Hermite Interpolation the parallel algorithm in worst case involves N/2 data communications, 2N+6 multiplications , 2N+3 subtrac...
متن کاملExtended Fibonacci cubes
The Fibonacci Cube is an interconnection network that possesses many desirable properties that are important in network design and application. The Fibonacci Cube can efficiently emulate many hypercube algorithms and uses fewer links than the comparable hypercube, while its size does not increase as fast as the hypercube. However, most Fibonacci Cubes (more than 2/3 of all) are not Hamiltonian....
متن کاملIndependent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes
A subset S of vertices in a graph G is said to be an independent set of G if each edge in the graph has at most one endpoint in S and a set W ( V is said to be a resolving set of G, if the vertices in G have distinct representations with respect to W. A resolving set W is said to be an independent resolving set, or an ir-set, if it is both resolving and independent. The minimum cardinality of W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/8661-2534